The Rupture Degree of Graphs with <i>k</i>-Tree
نویسندگان
چکیده
منابع مشابه
Rupture degree of graphs
We introduce a new graph parameter, the rupture degree. The rupture degree for a complete graph Kn is defined as 1 − n, and the rupture degree for an incomplete connected graph G is defined by r(G) = max{ω(G − X)− |X| − m(G − X) : X ⊂ V(G),ω(G − X) > 1}, where ω(G − X) is the number of components of G − X and m(G − X) is the order of a largest component of G − X . It is shown that this paramete...
متن کاملTenacity and rupture degree parameters for trapezoid graphs
Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.
متن کاملTree spanners of bounded degree graphs
A tree t-spanner of a graph G is a spanning tree of G such that the distance between pairs of vertices in the tree is at most t times their distance in G. Deciding tree t-spanner admissible graphs has been proved to be tractable for t < 3 and NP-complete for t > 3, while the complexity status of this problem is unresolved when t = 3. For every t > 2 and b > 0, an efficient dynamic programming a...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Discrete Mathematics
سال: 2016
ISSN: 2161-7635,2161-7643
DOI: 10.4236/ojdm.2016.62011